CS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗
نویسنده
چکیده
We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communication complexity toolbox (specifically, Disjointness); no new results are required. Let D and R be a finite domain and range, respectively. In this lecture, D will always be {0, 1}, while R might or might not be {0, 1}. A property is simply a set P of functions from D to R. Examples we have in mind include:
منابع مشابه
CS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 9 : Lower Bounds in Property Testing ∗
We first give a brief introduction to the field of property testing. Section 3 gives upper bounds for the canonical property of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. We won’t need to develop any new communication complexity; our existing toolbox (specifically, Disjointness) is already rich enough to de...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 6 : Data Structure Lower Bounds ∗
Next we discuss how to use communication complexity to prove lower bounds on the performance — meaning space, query time, and approximation — of data structures. Our case study will be the high-dimensional approximate nearest neighbor problem. There is a large literature on data structure lower bounds. There are several different ways to use communication complexity to prove such lower bounds, ...
متن کاملCommunication Complexity (for Algorithm Designers)
Preface The best algorithm designers prove both possibility and impossibility results — both upper and lower bounds. For example, every serious computer scientist knows a collection of canonical NP-complete problems and how to reduce them to other problems of interest. Communication complexity offers a clean theory that is extremely useful for proving lower bounds for lots of different fundamen...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 1 : Data Streams : Algorithms and Lower
This class is mostly about impossibility results — lower bounds on what can be accomplished by algorithms. However, our perspective will be unapologetically that of an algorithm designer. We’ll learn lower bound technology on a “need-to-know” basis, guided by fundamental algorithmic problems that we care about (perhaps theoretically, perhaps practically). That said, we will wind up learning qui...
متن کاملComplexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Algorithmic Game Theory ∗
This lecture explains some applications of communication complexity to proving lower bounds in algorithmic game theory (AGT), at the border of computer science and economics. There are a number of situations in AGT where the natural description size of an object is exponential a parameter of interest, and one would like to non-trivial computation in time polynomial in the parameter (logarithmic...
متن کامل